Two-Round Adaptively Secure MPC from Deniable Obfuscation
نویسنده
چکیده
We review the two-round statically-secure MPC protocol of [3], and intuitively motivate its construction from smaller building blocks. Then we consider the problems in making this protocol adaptively-secure, and present a proposed solution that slightly modifies the protocol to overcome these problems. In the process, we introduce the notion of “Deniable Obfuscation”, as an extension of Deniable Encryption. We give a construction of Deniable Obfuscation as a modification of the Deniable Encryption scheme in [5], which can also be seen as a corollary of a compiler in [2].
منابع مشابه
Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
Adaptively secure Multi-Party Computation (MPC) first studied by Canetti, Feige, Goldreich, and Naor in 1996, is a fundamental notion in cryptography. Adaptive security is particularly hard to achieve in settings where arbitrary number of parties can be corrupted and honest parties are not trusted to properly erase their internal state. We did not know how to realize constant round protocols fo...
متن کاملAdaptively Secure Multi-Party Computation from LWE (via Equivocal FHE)
Adaptively secure Multi-Party Computation (MPC) is an essential and fundamental notion in cryptography. In this work, we construct Universally Composable (UC) MPC protocols that are adaptively secure against all-but-one corruptions based on LWE. Our protocols have a constant number of rounds and communication complexity dependant only on the length of the inputs and outputs (it is independent o...
متن کاملOn Minimal Assumptions for Sender-Deniable Public Key Encryption
The primitive of deniable encryption was introduced by Canetti et al. (CRYPTO, 1997). Deniable encryption is an encryption scheme with the added feature that after transmitting a message m, both sender and receiver may produce random coins showing that the transmitted ciphertext was an encryption of any message m′ in the message space. Deniable encryption is a key tool for constructing incoerci...
متن کاملOn the Impossibility of Sender-Deniable Public Key Encryption
The primitive of deniable encryption was first introduced by Canetti et al. (CRYPTO, 1997). Deniable encryption is a regular public key encryption scheme with the added feature that after running the protocol honestly and transmitting a message m, both Sender and Receiver may produce random coins showing that the transmitted ciphertext was an encryption of any message m′ in the message space. D...
متن کاملRound Optimal Concurrent MPC via Strong Simulation
In this paper, we study the round complexity of concurrently secure multi-party computation (MPC) with super-polynomial simulation (SPS) in the plain model. In the plain model, there are known explicit attacks that show that concurrently secure MPC with polynomial simulation is impossible to achieve; SPS security is the most widely studied model for concurrently secure MPC in the plain model. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015